منابع مشابه
Relational Algebra and Equational Proofs
We show that two concepts involving equational provability can be elegantly formalized in terms of a relational algebra, equipped with two special-purpose mappings. We derive some calculus in order to prove that these concepts are equivalent, and that they are sound and complete. We illustrate the use of the relational framework by a few examples. We show how decidability of provability of an e...
متن کاملGroupoid of Equational Proofs
An equational presentation P = h ; V; E i induces a graph G P of terms and equations, while proof gures in P induces an -algebra A P on groupoids. Although the construction of A P is quite syntactic, it is not free over G P . In order to make the meaning of freeness precise, we introduce a notion of -graph, and show that A P is freely generated by the -graph G P induced by P . Incidentally, thi...
متن کاملCertifying and Synthesizing Membership Equational Proofs
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof tasks. The problem, then, is how to be sure that we can trust the correctness of a heterogeneous proof. In this work we focus on certification and synthesis of equational proofs, that are pervasive in most proof tasks ...
متن کاملEquational calculi and constant depth propositional proofs
We deene equational calculi for proving equations between functions in the complexity classes ACC(2) and TC 0 , and we show that proofs in these calculi can be simulated by polynomial size, constant depth proofs in Frege systems with counting modulo 2 and threshold connectives respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1995
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80009-4